Process Realizability

نویسنده

  • Samson Abramsky
چکیده

We develop a notion of realizability for Classical Linear Logic based on a concurrent process calculus.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Realizability is controllability

A choreography describes the interaction between services. It may be used for specification purposes, for instance serving as a contract in the design of an interorganizational business process. Typically, not all describable interactions make sense which motivates the study of the realizability problem for a given choreography. In this paper, we show that realizability can be traced back to th...

متن کامل

Lecture 2: Concentration of Measure

In the proof, we used both finite-ness of H and the realizability assumptions in a crucial way. But we already saw one problem where the theorem does not apply, namely learning linear separators, where |H| =∞. Of course it is more common than not that realizability is not satisfied, so we’d also like some sort of guarantee in the absence of realizability. In the next few lectures we will build ...

متن کامل

Study about Realizability Situation and Utilization Contexts of Water Sensitive Urban Design

Climate changes, failure to complete the natural cycle of water in the city due to unsustainableconstruction of the urban environments and increase of impervious surfaces, lack of nutrition of undergroundaquifer in the cities, unsustainable management of stormwater and the floods due to them in the periods of rainfallcaused to provide an approach that is called water sensitive urban design. Thi...

متن کامل

Realizing arithmetical formulæ

Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical realizability Realizability game Zoology Gender equality Introduction Curry-Howard Correct (for the execution) program might be untypable : let stupid n =. if n=n+1 then 27 else trué Etienne Miquey Realizing arithmetical formulae Classical ...

متن کامل

TRANSLATION INVARIANT REALIZABILITY PROBLEM ON THE d−DIMENSIONAL LATTICE: AN EXPLICIT CONSTRUCTION

We consider a particular instance of the truncated realizability problem on the d−dimensional lattice. Namely, given two functions ρ1(i) and ρ2(i, j) non-negative and symmetric on Z, we ask whether they are the first two correlation functions of a translation invariant point process. We provide an explicit construction of such a realizing process for any d ≥ 2 when the radial distribution has a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 1999